An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem

This paper proposes an exact algorithm to solve the one-to-one multiobjective shortest path problem. The solution involves determining a set of nondominated paths between two given nodes in graph that minimizes several objective functions. study is motivated by application this method determine cycling itineraries. proposed improves upon label-correcting rapidly problem on large graphs (i.e., up millions and edges). To verify performance algorithm, we use computational experiments compare it with best-known methods literature. numerical results confirm efficiency algorithm. Summary Contribution: deals classic operations research (the problem) real for An efficient based into which additional improvement techniques are integrated. Computational literature validate large-size (Center Discrete Mathematics Theoretical Computer Science (DIMACS) instances from ninth DIMACS challenge). New context itineraries also proposed.